Approaches for the performance increasing of software implementation of integer multiplication in prime fields

نویسندگان

  • Vladyslav Kovtun
  • Andrew Okhrimenko
چکیده

Vladislav Kovtun Chair of Information Security National Aviation University Kiev, Ukraine [email protected] Andrew Okhrimenko Chair of Information Security National Aviation University Kiev, Ukraine [email protected] Authors have proposed the approach to increase performance of software implementation of finite field multiplication algorithm, for 32-bit and 64-bit platforms. The approach is based on delayed carry mechanism of significant bit in sum accumulating. This allows to avoid the requirement of taking into account the significant bit carry at the each iteration of the sum accumulation loop. The delayed carry mechanism reduces the total number of additions and gives the opportunity to apply the modern parallelization technologies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approaches for the Parallelization of Software Implementation of Integer Multiplication

Approaches for the Parallelization of Software Implementation of Integer Multiplication In this paper there are considered several approaches for the increasing performance of software implementation of integer multiplication algorithm for the 32-bit & 64-bit platforms via parallelization. The main idea of algorithm parallelization consists in delayed carry mechanism using which authors have pr...

متن کامل

Software Elliptic Curve Cryptography

In this thesis, we study the software implementation of the NIST-recommended elliptic curves over prime fields. Our implementation goals are to achieve a fast, small, and portable cryptographic library, which supports elliptic curve digital signature generation and verification. The implementation results are presented on a Pentium I1 448.81 MHz. We also consider the sliding window algorithm (S...

متن کامل

Structure of finite wavelet frames over prime fields

‎This article presents a systematic study for structure of finite wavelet frames‎ ‎over prime fields‎. ‎Let $p$ be a positive prime integer and $mathbb{W}_p$‎ ‎be the finite wavelet group over the prime field $mathbb{Z}_p$‎. ‎We study theoretical frame aspects of finite wavelet systems generated by‎ ‎subgroups of the finite wavelet group $mathbb{W}_p$.

متن کامل

Efficient Software-Implementation of Finite Fields with Applications to Cryptography

In this work, we present a survey of efficient techniques for software implementation of finite field arithmetic especially suitable for cryptographic applications. We discuss different algorithms for three types of finite fields and their special versions popularly used in cryptography: Binary fields, prime fields and extension fields. Implementation details of the algorithms for field additio...

متن کامل

On Generalization of prime submodules

Let R be a commutative ring with identity and M be a unitary R-module. Let : S(M) −! S(M) [ {;} be a function, where S(M) is the set of submodules ofM. Suppose n 2 is a positive integer. A proper submodule P of M is called(n − 1, n) − -prime, if whenever a1, . . . , an−1 2 R and x 2 M and a1 . . . an−1x 2P(P), then there exists i 2 {1, . . . , n − 1} such that a1 . . . ai−1ai+1 . . . an−1x 2 P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012